Electroweakino constraints from LHC data

We investigate the sensitivity of existing LHC searches to the charginos and neutralinos of the MSSM when all the other superpartners are decoupled. In this limit, the underlying parameter space reduces to a simple four-dimensional set $\{M_1,\,M_2,\,\mu,\,\tan\beta\}$. We examine the constraints placed on this parameter space by a broad range of LHC searches taking into account the full set of relevant production and decay channels. We find that the exclusions implied by these searches exceed existing limits from LEP only for smaller values of the Bino mass $M_1 \lesssim 150$ GeV. Our results have implications for MSSM dark matter and electroweak baryogenesis.Comment: 30 pages, 15 figure

Reciprocity towards groups : a laboratory experiment on the causes

Field studies of conflict report cycles of mutual revenge between groups, often linked to perceptions of intergroup injustice. We test the hypothesis that people are predisposed to reciprocate against groups. In a computerized laboratory experiment, subjects who were harmed by a partner’s uncooperative action reacted by harming other members of the partner’s group. This group reciprocity was only observed when one group was seen to be unfairly advantaged. Our results support a behavioral mechanism leading from perceived injustice to intergroup conflict. We discuss the relevance of group reciprocity to economic and political phenomena including conflict, discrimination and team competition

Reciprocity towards groups

People exhibit group reciprocity when they retaliate, not against a person who harmed them, but against another person in that person's group. We tested for group reciprocity in laboratory experiments. Subjects played a Prisoner's Dilemma with partners from different groups. They then allocated money between themselves and other participants. In punishment games, subjects whose partner had defected punished participants from the partner's group more, compared to their punishment of participants from a third group. In dictator-style games, subjects did not exhibit group reciprocity. We examine possible correlates of group reciprocity, including group identification and cooperativeness

Group Reciprocity

People exhibit group reciprocity when they retaliate, not against the person who harmed them, but against somebody else in that person's group. Group reciprocity may be a key motivation behind intergroup conflict. We investigated group reciprocity in a laboratory experiment. After a group identity manipulation, subjects played a Prisoner's Dilemma with others from different groups. Subjects then allocated money between themselves and others, learning the group of the others. Subjects who knew that their partner in the Prisoner's Dilemma had defected became relatively less generous to people from the partner's group, compared to a third group. We use our experiment to develop hypotheses about group reciprocity and its correlates.reciprocity, groups, conflict

A characterization of dual quermassintegrals and the roots of dual steiner polynomials

For any $I\subset\mathbb{R}$ finite with $0\in I$, we provide a characterization of those tuples $(\omega_i)_{i\in I}$ of positive numbers which are dual querma\ss integrals of two star bodies. It turns out that this problem is related to the moment problem. Based on this relation we also get new inequalities for the dual querma\ss integrals. Moreover, the above characterization will be the key tool in order to investigate structural properties of the set of roots of dual Steiner polynomials of star bodies

Fast Solvers for Cahn-Hilliard Inpainting

We consider the efficient solution of the modified Cahn-Hilliard equation for binary image inpainting using convexity splitting, which allows an unconditionally gradient stable time-discretization scheme. We look at a double-well as well as a double obstacle potential. For the latter we get a nonlinear system for which we apply a semi-smooth Newton method combined with a Moreau-Yosida regularization technique. At the heart of both methods lies the solution of large and sparse linear systems. We introduce and study block-triangular preconditioners using an efficient and easy to apply Schur complement approximation. Numerical results indicate that our preconditioners work very well for both problems and show that qualitatively better results can be obtained using the double obstacle potential